The Homotopy Type of the Complexes of Graph Homomorphisms between Cycles
نویسندگان
چکیده
In this paper we study the homotopy type of Hom (Cm, Cn), where Ck is the cyclic graph with k vertices. We enumerate connected components of Hom (Cm, Cn) and show that each such component is either homeomorphic to a point or homotopy equivalent to S1. Moreover, we prove that Hom (Cm, Ln) is either empty or is homotopy equivalent to the union of two points, where Ln is an n-string, i.e., a tree with n vertices and no branching points.
منابع مشابه
Homotopy Type of Complexes of Graph Homomorphisms between Cycles
In this paper we study the homotopy type of Hom (Cm, Cn), where Ck is the cyclic graph with k vertices. We enumerate connected components of Hom (Cm, Cn) and show that each such component is either homeomorphic to a point or homotopy equivalent to S1. Moreover, we prove that Hom (Cm, Ln) is either empty or is homotopy equivalent to the union of two points, where Ln is an n-string, i.e., a tree ...
متن کاملTopology of Hom complexes and test graphs for bounding chromatic number
The Hom complex of homomorphisms between two graphs was originally introduced to provide topological lower bounds on the chromatic number of graphs. In this paper we introduce new methods for understanding the topology of Hom complexes, mostly in the context of Γ-actions on graphs and posets (for some group Γ). We view the Hom(T, •) and Hom(•, G) as functors from graphs to posets, and introduce...
متن کامل[hal-00740434, v1] Simplicial simple-homotopy of flag complexes in terms of graphs
A flag complex can be defined as a simplicial complex whose simplices correspond to complete subgraphs of its 1-skeleton taken as a graph. In this article, by introducing the notion of s-dismantlability, we shall define the s-homotopy type of a graph and show in particular that two finite graphs have the same s-homotopy type if, and only if, the two flag complexes determined by these graphs hav...
متن کاملar X iv : m at h / 03 10 05 6 v 3 [ m at h . C O ] 2 6 A ug 2 00 4 COMPLEXES OF GRAPH HOMOMORPHISMS
Hom (G,H) is a polyhedral complex defined for any two undirected graphs G and H. This construction was introduced by Lovász to give lower bounds for chromatic numbers of graphs. In this paper we initiate the study of the topological properties of this class of complexes. We prove that Hom (Km,Kn) is homotopy equivalent to a wedge of (n−m)dimensional spheres, and provide an enumeration formula f...
متن کاملSome Characterizations of Hopf Group on Fuzzy Topological Spaces
In this paper, some fundamental concepts are given relating to fuzzytopological spaces. Then it is shown that there is a contravariant functorfrom the category of the pointed fuzzy topological spaces to the category ofgroups and homomorphisms. Also the fuzzy topological spaces which are Hopfspaces are investigated and it is shown that a pointed fuzzy toplogicalspace having the same homotopy typ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004